Structured communication in torus networks
نویسندگان
چکیده
This paper is a study of one-to-all and all-to-all data movement patterns on cycles, tori, and multidimensional tori that use synchronous circuit-switched routing with virtual channels. The data movement patterns that we study are broadcasting, scattering, gossiping, and multi-scattering. We present new circuit-switching algon’thms for all of these patterns for cycles, two-dimensional tori, and multidimensional tori. We compare our new algorithms to the best known store-and-forward algorithms and lower bounds. In most cases, we conclude that circuitswitched routing is best when messages are “short” and store-and-forward routing is best for long messages. Surprisingly, a few of our new circuit-switching algorithms outperform all known store-and-forward algorithms for all message lengths.
منابع مشابه
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
The torus is a popular interconnection topology and several commercial multicomputers use a torus as the basis of their communication network. Moreover, there are many parallel algorithms with torus-structured and mesh-structured task graphs have been developed. If one network can embed a mesh or torus network, the algorithms with mesh-structured or torus-structured can also be used in this net...
متن کاملStructured Communication in Cut-through Routed Torus Networks
This paper is a study of one-to-all and all-to-all data movement patterns on cycles and multi-dimensional toroidal meshes that use cut-through (e.g., circuit-switched, wormhole) routing with virtual channels. We present new cut-through algorithms for broadcasting, scattering, gossiping, and multi-scattering on cycles and multi-dimensional torus networks. Our algorithms use virtual channels to i...
متن کاملOn Dynamic Communication Performance of a Hierarchical 3D-Mesh Network
A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a Hierarchical 3D-Mesh (H3DM) network using a deadlock-free routing algorithm with minimum number of virtual channels unde...
متن کاملOptimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori
All-to-all personalized communication is a basic communication operation in a parallel computing environment. In this operation, each processor sends a distinct message to every other processor. It is used in several parallel computing applications, such as the fast Fourier transform. This paper presents new algorithms to perform the all-to-all personalized communication on ringand torus-struct...
متن کاملInapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks
We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fix...
متن کاملDynamic Communication Performance of the TESH Network under Nonuniform Traffic Patterns
Interconnection networks play a crucial role in the performance of massively parallel computer systems. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computer systems. The Tori-connected mESH (TESH) Network is a 2D-torus network of multiple basic modules, in which the basic mod...
متن کامل